The Maximum Sum-Balaban Index of Tree Graph with Given Vertices and Maximum Degree
نویسندگان
چکیده
منابع مشابه
The Maximum Balaban Index (Sum-Balaban Index) of Unicyclic Graphs
The Balaban index of a connected graph G is defined as J(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)DG(v) , and the Sum-Balaban index is defined as SJ(G) = |E(G)| μ+ 1 ∑ e=uv∈E(G) 1 √ DG(u)+DG(v) , where DG(u) = ∑ w∈V (G) dG(u,w), and μ is the cyclomatic number of G. In this paper, the unicyclic graphs with the maximum Balaban index and the maximum Sum-Balaban index among all unicyclic graphs on n v...
متن کاملThe Maximum Wiener Index of Trees with Given Degree Sequences
The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang in [23] gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.
متن کاملThe Variable Wiener Index of Trees with Given Maximum Degree
The work is supported by Training and plan projects of college students' innovation and pioneering in Guangdong Province(No.1056412059). Abstract Wiener index proposed by Harold Wiener in 1947 is a very important topological index which is widely applied in chemical research. Gutman et al. extended the Wiener index to variable Wiener index. M. H. Liu et al. obtained the maximum variable Wiene...
متن کاملReducing the maximum degree of a graph by deleting vertices
We investigate the smallest number λ(G) of vertices that need to be removed from a non-empty graph G so that the resulting graph has a smaller maximum degree. We prove that if n is the number of vertices, k is the maximum degree, and t is the number of vertices of degree k, then λ(G) ≤ n+(k−1)t 2k . We also show that λ(G) ≤ n k+1 if G is a tree. These bounds are sharp. We provide other bounds t...
متن کاملThe Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs G with n vertices and ∆(G) ≤ r, which has the most complete subgraphs of size t, for t ≥ 3. The conjectured extremal graph is aKr+1 ∪Kb, where n = a(r + 1) + b with 0 ≤ b ≤ r. Gan, Loh, and Sudakov proved the conjecture wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2013
ISSN: 2324-7991,2324-8009
DOI: 10.12677/aam.2013.24019